Integer squaring algorithm with delayed carry mechanism
نویسندگان
چکیده
منابع مشابه
Squaring Algorithms with Delayed Carry Method and Efficient Parallelization
Increasing amounts of information that needs to be protecting put in claims specific requirements for information security systems. The main goal of this paper is to find ways to increase performance of cryptographic transformation with public key by increasing performance of integers squaring. Authors use delayed carry mechanism and approaches of effective parallelization for Comba multiplicat...
متن کاملSquaring the Square with Integer Linear Programming
We consider so-called “squaring the square”-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstrate that a mathematically rigorous solution can be quite involved. As an alternative to exhaustive enumeration using tailored algorithms we describe the general approach of formulating the problem as an integer line...
متن کاملDelayed Dispersal: Youth Costs Carry Lifetime Gains
An analysis of reproductive success in the green woodhoopoe Phoeniculus purpures challenges the view that delayed dispersal is costly. Females delaying dispersal for longer had more reproductive events in life and higher lifetime production of offspring.
متن کاملEfficient Squaring Algorithm for Xate Pairing with Freeman Curve
Recently, pairing–based cryptographies have attracted much attention. For fast pairing calculation, not only pairing algorithms but also arithmetic operations in extension field should be efficient. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper proposes an efficient squaring algorithm in extension field for Freema...
متن کاملMinimum-adder integer multipliers using carry-save adders
In this paper we investigate graph-based minimum-adder integer multipliers using carry-save adders. The previously proposed approaches use carry-propagation adders with two inputs and one output and are not suitable for carry-save adder implementation when we have a single input and a carry-save output of the multiplier. Using carry-save adders avoids carry propagation and will result in a high...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ukrainian Scientific Journal of Information Security
سال: 2013
ISSN: 2411-071X,2225-5036
DOI: 10.18372/2225-5036.19.5649